Step of Proof: bnot_of_le_int
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
bnot
of
le
int
:
i
,
j
:
. (
i
z
j
) =
j
<z
i
latex
by ((UnivCD)
CollapseTHENA ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
1.
i
:
C1:
2.
j
:
C1:
(
i
z
j
) =
j
<z
i
C
.
Definitions
t
T
,
x
:
A
.
B
(
x
)
origin